The irregular cutting-stock problem - a new procedure for deriving the no-fit polygon
نویسندگان
چکیده
The no"t polygon is a powerful and e!ective tool for handling the geometry required for a range of solution approaches to two-dimensional irregular cutting-stock problems. However, unless all the pieces are convex, it is widely perceived as being di$cult to implement, and its use has therefore been somewhat limited. The primary purpose of this paper is to correct this misconception by introducing a new method of calculating the no"t polygon. Although it is based on previous approaches which use the mathematical concept of Minkowski sums, this new method can be stated as a set of simple rules that can be implemented without an indepth understanding of the underlying mathematics. The result is an approach that is both very general and easy to use.
منابع مشابه
A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
The nofit polygon an important tool in the area of irregular shape stock cutting problems. It provides efficient handling of the geometric characteristics of the problem. The paper presents a new algorithmic procedure for deriving this tool. Abstract The nofit polygon is a powerful and effective tool for handling the geometric requirements of solution approaches to irregular cutting and packing...
متن کاملComplete and robust no-fit polygon generation for the irregular stock cutting problem
The no-fit polygon is a construct that can be used between pairs of shapes for fast and efficient handling of geometry within irregular two-dimensional stock cutting problems. Previously, the no-fit polygon (NFP) has not been widely applied because of the perception that it is difficult to implement and because of the lack of generic approaches that can cope with all problem cases without speci...
متن کاملHeuristics for two-dimensional knapsack and cutting stock problems with items of irregular shape
In this paper, the two-dimensional cutting/packing problem with items that correspond to simple polygons that may contain holes are studied in which we propose algorithms based on No-Fit polygon computation. We present a GRASP based heuristic for the 0/1 version of the Knapsack Problem, and another heuristic for the unconstrained version of the Knapsack Problem. This last heuristic is divided i...
متن کاملApplying Simulated Annealing and the No Fit Polygon to the Nesting Problem
This paper presents a new method to pack convex polygons into bins (the nesting problem). To do this polygons are placed in rows within bins using a metaheuristic algorithm (simulated annealing) and by utilising the No Fit Polygon. We show that simulated annealing out performs hill climbing. The nesting algorithm is described in detail, along with various aspects that have been incorporated in ...
متن کاملApplying Evolutionary Algorithms and the No Fit Polygon to the a Nesting Problem
In [6] solutions for the nesting problem are produced using the No Fit Polygon (NFP), simulated annealing (SA) and a new evaluation method. It showed that SA could out perform hill climbing, thus suggesting that evolutionary approaches produce better solutions than a standard search algorithm. In this paper this work is developed. Genetic algorithms (GA) and tabu search (TS) are compared with t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computers & OR
دوره 28 شماره
صفحات -
تاریخ انتشار 2001